Correction: Heuristic approaches for the car sequencing problems with block batches
نویسندگان
چکیده
منابع مشابه
Exact and heuristic methods for solving the Car Sequencing Problem
In this thesis, I present several different methods for solving the Car Sequencing Problem. The process of scheduling vehicles along a production line has to take several constraints into account which are defined by the body shop, the paint shop and the assembly shop. I attached importance especially to the paint shop constraints, because no violations are allowed here. Beside the enhancement ...
متن کاملA Study of Greedy, Local Search, and Ant Colony Optimization Approaches for Car Sequencing Problems
This paper describes and compares several heuristic approaches for the car sequencing problem. We first study greedy heuristics, and show that dynamic ones clearly outperform their static counterparts. We then describe local search and ant colony optimization (ACO) approaches, that both integrate greedy heuristics, and experimentally compare them on benchmark instances. ACO yields the best solu...
متن کاملTwo local search approaches for solving real-life car sequencing problems
The NP-hard problem of car sequencing appears as the heart of the logistic process of many car manufacturers. The subject of the ROADEF’2005 Challenge addressed a car sequencing problem proposed by the car manufacturer RENAULT, more complex than the academic problem generally addressed in the literature. This paper describes two local search approaches for this problem. In the first part, a new...
متن کاملLarge neighborhood improvements for solving car sequencing problems
The NP-hard problem of car sequencing has received a lot of attention these last years. Whereas a direct approach based on integer programming or constraint programming is generally fruitless when the number of vehicles to sequence exceeds the hundred, several heuristics have shown their efficiency. In this paper, very large-scale neighborhood improvement techniques based on integer programming...
متن کاملTackling Car Sequencing Problems Using a Generic Genetic Algorithm Strategy
The car sequencing problem (CarSP) was seen as a challenge to artificial intelligence. The CarSP is a version of the job-shop scheduling problem which is known to be NP-complete. The task in the CarSP is to schedule a given number of cars (of different types) in a sequence to allow the teams in each work station on the assembly line to fit the required options (e.g. radio, sunroof) on the cars ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Eurasip Journal on Wireless Communications and Networking
سال: 2022
ISSN: ['1687-1499', '1687-1472']
DOI: https://doi.org/10.1186/s13638-022-02194-4